Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
نویسندگان
چکیده
This paper makes two contributions to the verification of multi agentsystems modelled by interleaved interpreted systems. Firstly, the paper presents theoretical underpinnings of the SAT-based bounded model checking (BMC) approach for LTL extended with the epistemic component (LTLK) over interleaved interpreted systems. Secondly, the BMC method has been implemented and tested on several benchmarks for MAS. The preliminary experimental results reveal advantages and disadvantages of our SAT-based BMC for LTLK and show that the method has a significant potential.
منابع مشابه
Bounded model checking for knowledge and linear time
We investigate symbolic approaches to Bounded Model Checking (BMC) for the Linear Temporal Logic extended with epistemic components (LTLK), interpreted over Interleaved Interpreted Systems. We propose two BMC translations for LTLK one is based on SAT and the other is based on BDD which we have implemented and tested on several benchmarks. We report on our experimental results that reveal advant...
متن کاملBDD-based Bounded Model Checking for LTLK over Two Variants of Interpreted Systems
We present a novel approach to verification of multi-agent systems by bounded model checking for Linear Time Temporal Logic extended with the epistemic component (LTLK). The systems are modelled by two variants of interpreted systems: standard and interleaved ones. Our method is based on binary decision diagrams (BDD). We describe the algorithm and provide its experimental evaluation together w...
متن کاملBounded Model Checking for Linear Time Temporal-Epistemic Logic
We present a novel approach to the verification of multi-agent systems using bounded model checking for specifications in LTLK, a linear time temporal-epistemic logic. The method is based on binary decision diagrams rather than the standard conversion to Boolean satisfiability. We apply the approach to two classes of interpreted systems: the standard, synchronous semantics and the interleaved s...
متن کاملPartial order reduction for model checking interleaved multi-agent systems
We investigate partial order reduction for model checking of multiagent systems by focusing on interleaved interpreted systems. These are a particular class of interpreted systems, a mainstream MAS formalism, in which only one action at the time is performed in the system. We present a notion of stutteringequivalence, and prove the semantical equivalence of stuttering-equivalent traces with res...
متن کاملBounded Model Checking Linear Time and Knowledge Using Decision Diagrams
We present a novel approach to verification of multi-agent systems by bounded model checking for LTLK, i.e., Linear Time Temporal Logic extended with the epistemic component, which is interpreted over interleaved interpreted systems. Our method is based on binary decision diagrams. We describe the algorithm and provide its experimental evaluation together with the comparison with an existing tool.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 119 شماره
صفحات -
تاریخ انتشار 2012